Modelling theories of actions by Equational Logic Programs

نویسنده

  • Michael Thielscher
چکیده

A sound and complete approach for encoding the action description language A developed by M. Gelfond and V. Lifschitz in an equational logic program is given. Our results allow the comparison of the resource-oriented equational logic based approach and various other methods designed for reasoning about actions, most of them based on variants of the situation calculus, which were also related to the action description language recently. A non-trivial extension of A is proposed which allows to handle uncertainty in form of non-deterministic action descriptions, i.e. where actions may have alternative randomized eeects. It is described how the equational logic programming approach forms a sound and complete encoding of this extended action description language A ND as well.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Conditional Equational Theories and Complete Sets of Transformations

The idea to combine the advantages of function and logic programming has attracted many researches. Their work ranges from the integration of existing languages over higher-order logic to equational logic languages, where logic programs are augmented with equational theories. Recently, it has been proposed to handle those equational theories by complete sets of transformations. These transforma...

متن کامل

A Method for Implementing Equational Theories as Logic Programs

Equational theories underly many elds of computing, including functional programming, symbolic algebra, theorem proving, term rewriting and constraint solving. In this paper we show a method for implementing many equational theories with a limited class of logic programs. We de ne regular equational theories, a useful class of theories, and illustrate with a number of examples how our method ca...

متن کامل

Kleene Algebra Modulo Theories

Kleene algebras with tests (KATs) o er sound, complete, and decidable equational reasoning about regularly structured programs. Since NetKAT demonstrated how well various extensions of KATs apply to computer networks, interest in KATs has increased greatly. Unfortunately, extending a KAT to a particular domain by adding custom primitives, proving its equational theory sound and complete, and co...

متن کامل

Equational reasoning and combination methods: from programs to proofs

In this habilitation, we present decision procedures and solvers which are useful in veri cation. We consider rst order logic with equality. This logic is undecidable in general, but the study of interesting fragments leads to automatic (push-button) tools. The notion of equality is particularly interesting for programming via oriented equalities (rule-based programming) or for deriving proofs ...

متن کامل

Equational Logic and Theories of Action

This is a survey on reasoning about situations, actions, and causality within equational logic. Its main feature is the representation of situations as multisets of resources. Such resources are consumed whenever the conditions of an action are satissed and are produced whenever the action is applied. It is demonstrated that the well{known frame and ramiication problems can be elegantly solved ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993